Collective Sorting Tuple Spaces
نویسندگان
چکیده
Coordination of multiagent systems is recently moving towards the application of techniques coming from the research context of complex systems: adaptivity and selforganisation are exploited in order to tackle openness, dynamism and unpredictability of typical multiagent systems applications. In this paper we focus on a coordination problem called collective sorting, where autonomous agents are assigned the task of moving tuples across different tuple spaces according to local criteria, resulting in the emergence of the complete clustering property. Using a library we developed for the MAUDE term rewriting system, we simulate the behaviour of this system and evaluate some solutions to this problem.
منابع مشابه
Simulating Emergent Properties of Coordination in Maude: the Collective Sorting Case
Recent coordination languages and models are moving towards the application of techniques coming from the research context of complex systems: adaptivity and self-organisation are exploited in order to tackle the openness, dynamism and unpredictability of today’s distributed systems. In this area, systems are to be described using stochastic models, and simulation is considered a valuable tool ...
متن کاملDesigning self-organising environments with agents and artefacts: a simulation-driven approach
We propose a methodological approach for tackling the early design stages of self-organising Multiagent Systems (MASs). We adopt an architectural pattern based on the Agents and Artefacts (A&A) metamodel: self-organisation mechanisms are added to an existing environment of artefacts by embedding them into environmental agents. We rely on a three-stage design approach with modelling, simulation ...
متن کاملAuction-Based Agent Negotiation via Programmable Tuple Spaces
Auctions are proposed as a distributed negotiation mean, particularly useful in multiagent systems where both cooperative and self-interested agents compete for resources and services. The aim of this paper is to show how auction mechanisms on the Internet can be easily implemented by using programmable tuple spaces. Tuple spaces are shared repositories of information that follow the Linda mode...
متن کاملOn the Implementation of an Asymmetric Hyperspace in Linear Memory: Implementing Tuple Spaces
This report sets out the results of an investigation into the distributed implementation of tuple spaces, hence Linda. There are numerous such schemes for implementing distributed tuple spaces, and a selection of these implementations are examined. It is observed that all the implementations have a great deal of similarities. These similarities form the basis for a generalised tuple space imple...
متن کاملUsing the Bonita primitives: A case study
The co-ordination language Linda has been used for parallel processing for many years. Linda uses a shared tuple space and a number of primitives to provide access to the tuple space and thereby enabling communication between processes executing concurrently. Linda provides asynchronous communication between processes, but synchronous access between the processes and the tuple spaces. The Bonit...
متن کامل